Intransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules
نویسنده
چکیده
Our paper studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we consider logical operation N and the operation until U (actually, the time overall) to be directed to past). The basic mathematical problems we study are the fundamental ones for any logical system decidability and decidability w.r.t. admissible rules. First, we consider the logic with non-uniform non-transitivity, and describe how to solve the decidability problem for this logic. Then we consider a modification of this logic linear temporal logic with uniform intransitivity and solve the problem of admissibility for inference rules. A series of open problems is enumerated in the concluding part of the paper.
منابع مشابه
Linear Intransitive Temporal Logic of Knowledge LTK_r, Decision Algorithms, Inference Rules
Our paper investigates the linear logic of knowledge and time LTKr with reflexive intransitive time relation. The logic is defined semantically, – as the set of formulas true at special frames with intransitive and reflexive time binary relation. The LTKr-frames are linear chains of clusters connected by a reflexive intransitive relation RT . Elements inside a cluster are connected by several e...
متن کاملIntransitive Temporal Multi-agent's Logic, Knowledge and Uncertainty, Plausibility
We study intransitive temporal logic implementing multiagent’s approach and formalizing knowledge and uncertainty. An innovative point here is usage of non-transitive linear time and multi-valued models the ones using separate valuations Vj for agent’s knowledge of facts and summarized (agreed) valuation together with rules for computation truth values for compound formulas. The basic mathemati...
متن کاملLinear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent’s knowledge in non-transitive temporal linear logic LTLPast,m. We find algorithms solving mentioned problems, justify our approach to consider linear non-transitive time with several examples. Main, most complicated, technical new result is it decidability of LTLPa...
متن کاملLinear Temporal Logic LTL: Basis for Admissible Rules
The object of our study is the propositional linear temporal logic LTL with operations Until and Next. We deal with inference rules admissible in LTL. Earlier the decidability of LTL w.r.t. to admissibility was shown. That, in particular, allowed to suggest a recursive infinite basis for admissible rules. However, that result gives no information about the structure and properties of such basis...
متن کاملPreservation of Admissible Rules when Combining Logics
Admissible rules are shown to be conservatively preserved by the meetcombination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of the set of admissible rules are also shown to be preserved, the latter with no penalty on the time complexity. Examples are provided for the meet-combination ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.08761 شماره
صفحات -
تاریخ انتشار 2015